- finite methods in mathematical programming
- иссл. опер. конечные методы математического программирования (численные методы, позволяющие получить решение задачи за определенное количество шагов (итераций))Ant:
Англо-русский экономический словарь.
finite methods in mathematical programming
Смотреть что такое "finite methods in mathematical programming" в других словарях:
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
Mathematical economics — Economics … Wikipedia
Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… … Wikipedia
Programming language — lists Alphabetical Categorical Chronological Generational A programming language is an artificial language designed to communicate instructions to a machine, particularly a computer. Programming languages can be used to create programs that… … Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… … Wikipedia
Nonlinear programming — In mathematics, nonlinear programming (NLP) is the process of solving a system of equalities and inequalities, collectively termed constraints, over a set of unknown real variables, along with an objective function to be maximized or minimized,… … Wikipedia
Semi infinite programming — In mathematics, semi infinite programming (SIP) is an optimization problem with a finite number of variables and an infinite number of constraints, or a infinite number of variables and a finite number of constraints… … Wikipedia
Generalized semi-infinite programming — In mathematics, generalized semi infinite programming (GSIP) is an optimization problem with a finite number of variables and an infinite number of constraints. The constraints are parameterized by parameters and the feasible set of the… … Wikipedia
Comparison of programming paradigms — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computin … Wikipedia
